Local Approximability of Minimum Dominating Set on Planar Graphs
نویسندگان
چکیده
We show that there is no deterministic local algorithm (constant-time distributed graph algorithm) that finds a (7 − )-approximation of a minimum dominating set on planar graphs, for any positive constant . In prior work, the best lower bound on the approximation ratio has been 5− ; there is also an upper bound of 52.
منابع مشابه
Distributed Dominating Set Approximations beyond Planar Graphs
The Minimum Dominating Set (MDS) problem is one of the most fundamental and challenging problems in distributed computing. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last years, there has been much progress on computing local approximations on sparse graphs, and in particular planar graphs. In this paper we study distributed an...
متن کاملApproximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching
We provide the first interesting explicit lower bounds on efficient approximability for two closely related optimization problems in graphs, Minimum Edge Dominating Set and Minimum Maximal Matching. We show that it is NP-hard to approximate the solution of both problems to within any constant factor smaller than 7 6 . The result extends with negligible loss to bounded degree graphs and to every...
متن کاملA local constant factor approximation for the minimum dominating set problem on bounded genus graphs
The Minimum Dominating Set (MDS) problem is not only one of the most fundamental problems in distributed computing, it is also one of the most challenging ones. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last years, several breakthroughs have been made on computing local approximations on sparse graphs. This paper presents a de...
متن کاملApproximability of identifying codes and locating-dominating codes
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible to approximate both problems within a logarithmic factor, but sublogarithmic approximation ratios are intractable. In bounded-degree graphs, there is a trivial constant-factor approximation algorithm, but arbitrarily lo...
متن کاملInapproximability of Dominating Set in Power Law Graphs
We give logarithmic lower bounds for the approximability of the Minimum Dominating Set problem in connected (α, β)-Power Law Graphs. We give also a best up to now upper approximation bound on the problem for the case of the parameters β > 2. We develop also a new functional method for proving lower approximation bounds and display a sharp phase transition between approximability and inapproxima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1402.2549 شماره
صفحات -
تاریخ انتشار 2014